Geometric Applications Of Posets

نویسندگان

  • Michael Segal
  • Klara Kedem
چکیده

We show the power of posets in computational geometry by solving several problems posed on a set S of n points in the plane: (1) nd the n ? k ? 1 rectilinear farthest neighbors (or, equivalently, k nearest neighbors) to every point of S (extendable to higher dimensions), (2) enumerate the k largest (smallest) rectilinear distances in decreasing (increasing) order among the points of S, (3) given a distance > 0, report all the pairs of points that belong to S and are of rectilinear distance or more (less), covering k n 2 points of S by rectilinear (4) and circular (5) concentric rings, and (6) given a number k n 2 decide whether a query rectangle contains k points or less.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

CONDITIONAL EXPECTATION IN THE KOPKA'S D-POSETS

The notion of a $D$-poset was introduced in a connection withquantum mechanical models. In this paper, we introduce theconditional expectation of  random variables on theK^{o}pka's $D$-Poset and prove the basic properties ofconditional expectation on this  structure.

متن کامل

Realization of Posets

We prove a very general representation theorem for posets and, as a corollary, deduce that any abstract simplicial complex has a geometric realization in the Euclidean space of dimension dimP (∆) − 1, where dim P (∆) is the Dushnik-Miller dimension of the face order of ∆. Communicated by H. de Fraysseix and and J. Kratochv́ıl: submitted May 2000; revised July 2001. P. Ossona de Mendez, Realizati...

متن کامل

Combinatorics of Topological Posets: Homotopy Complementation Formulas

We show that the well known homotopy complementation formula of Björner andWalker admits several closely related generalizations on different classes of topological posets (lattices). The utility of this technique is demonstrated on some classes of topological posets including the Grassmannian and configuration posets, G̃n(R) and expn(X) which were introduced and studied by V. Vassiliev. Among o...

متن کامل

The concept of logic entropy on D-posets

In this paper, a new invariant called {it logic entropy} for dynamical systems on a D-poset is introduced. Also, the {it conditional logical entropy} is defined and then some of its properties are studied.  The invariance of the {it logic entropy} of a system  under isomorphism is proved. At the end,  the notion of an $ m $-generator of a dynamical system is introduced and a version of the Kolm...

متن کامل

Se p 20 02 HIGHER LAWRENCE CONFIGURATIONS

Any configuration of lattice vectors gives rise to a hierarchy of higher-dimensional configurations which generalize the Lawrence construction in geometric combinatorics. We prove finiteness results for the Markov bases, Graver bases and face posets of these configurations, and we discuss applications to the statistical theory of log-linear models.

متن کامل

Some drifts on posets and its application to fuzzy subalgebras

In this paper, given a poset $(X,leq)$, we introduce some  drifts on a groupoid $(X,*)$ with respect to $(X,leq)$, and we obtain several properties of these drifts related to the notion of $Bin(X)$. We discuss some connections between fuzzy subalgebras and upward drifts.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997